Exploiting semidefinite relaxations in constraint programming
نویسندگان
چکیده
منابع مشابه
Exploiting semidefinite relaxations in constraint programming
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of semidefinite relaxations within constraint programming. In principle, we use the solution of a semidefinite relaxation to guide the traversal of the search tree, using a limited discrepancy search strategy. Furthermor...
متن کاملSemidefinite Programming Relaxations in Timetabling
This paper extends semidefinite programming relaxations of graph colouring to bounded graph colouring and extensions encountered in timetabling, where room sizes, room features, room stability, and pre-allocated assignments are considered. A matrix-free implementation of an augmented Lagrangian method is presented. Encouraging computational results are reported for conflict graphs from all thre...
متن کاملSemidefinite Relaxations for Integer Programming
We survey some recent developments in the area of semidefinite optimization applied to integer programming. After recalling some generic modeling techniques to obtain semidefinite relaxations for NP-hard problems, we look at the theoretical power of semidefinite optimization in the context of the Max-Cut and the Coloring Problem. In the second part, we consider algorithmic questions related to ...
متن کاملSemidefinite programming relaxations for semialgebraic problems
A hierarchy of convex relaxations for semialgebraic problems is introduced. For questions reducible to a finite number of polynomial equalities and inequalities, it is shown how to construct a complete family of polynomially sized semidefinite programming conditions that prove infeasibility. The main tools employed are a semidefinite programming formulation of the sum of squares decomposition f...
متن کاملOn Doubly Positive Semidefinite Programming Relaxations
Recently, researchers have been interested in studying the semidefinite programming (SDP) relaxation model, where the matrix is both positive semidefinite and entry-wise nonnegative, for quadratically constrained quadratic programming (QCQP). Comparing to the basic SDP relaxation, this doubly-positive SDP model possesses additional O(n2) constraints, which makes the SDP solution complexity subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2006
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.01.011